Logic Synthesis of LUT Cascades with Limited Rails
نویسنده
چکیده
Programmable LUT cascades are used to evaluate multi-output Boolean functions. This paper shows several representations of multi-output functions and introduces a new decomposition algorithm applicable to these representations. The algorithm produces LUT cascades with the limited number of rails, which leads to significantly faster circuits and applicability to large designs. The experiment shows that the proposed algorithm performs well on benchmark functions. Keyword Programmable Logic, Look-Up Table (LUT), Logic Synthesis, Decomposition, Binary Decision Diagrams.
منابع مشابه
LUT Cascades and Emulators for Realization of Logic Functions
Two types of programmable logic devices using LUTs (Look-Up Tables) are presented. An LUT cascade directly implements logic functions by a series connection of LUTs, while an emulator emulates an LUT cascade by sequentially accessing LUTs. The LUT cascade is faster, but has a limited logic capability, while the emulator is slower, but has a higher logic capability. LUT cascades and emulators ca...
متن کاملBDD Representation for Incompletely Specified Multiple-Output Logic Functions and Its Applications to the Design of LUT Cascades
A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD for CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD for CFs. An algorithm to reduce the widths of BDD for CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental r...
متن کاملEncoding of Boolean Functions and its Application to LUT Cascade Synthesis
The problem of encoding arises in several areas of logic synthesis. Due to the nature of this problem, it is often difficult to systematically explore the space of all feasible encodings in order to find an optimal one. In this paper, we show that when the objects to be encoded are Boolean functions, it is possible to formulate and solve the problem optimally. We present a general approach to t...
متن کاملA Design Algorithm for Sequential Circuits Using LUT Rings
This paper shows a design method for a sequential circuit by using a Look-Up Table (LUT) ring. An LUT ring consists of memories, a programmable interconnection network, a feed-back register, an output register, and a control circuit. It sequentially emulates an LUT cascade that represents the state transition functions and the output functions. We present two algorithms for synthesizing a seque...
متن کاملA PC-Based Logic Simulator Using a Look-Up Table Cascade Emulator
This paper represents a cycle-based logic simulation method using an LUT cascade emulator, where an LUT cascade consists of multiple-output LUTs (cells) connected in series. The LUT cascade emulator is an architecture that emulates LUT cascades. It has a control part, a memory for logic, and registers. It connects the memory to registers through a programmable interconnection circuit, and evalu...
متن کامل